Scalable Multiparty Computation with Nearly Optimal Work and Resilience
نویسندگان
چکیده
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmically with n (ignoring an additive term that depends on n but not on the complexity of f). Moreover, the protocol is also nearly optimal in terms of resilience, providing computational security against an active, adaptive adversary corrupting a (1/2− ) fraction of the players, for an arbitrary > 0.
منابع مشابه
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n-party randomized function and show that if f can be computed by a circuit of size c, then O(cn2κ) is an upper bound for active security with optimal resilience t < n/2 and security parameter κ. This improves on the communicati...
متن کاملUpper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation (Full Version)
We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n-party randomized function and show that if f can be computed by a circuit of size c, then O(cnκ) is an upper bound for active security with optimal resilience t < n/2 and security parameter κ. This improves on the communicatio...
متن کاملUpper Bounds on the Communication Complexity of Cryptographic Multiparty Computation
We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n-party randomized function and show that if f can be computed by a circuit of size c, then O(cnκ+nκ) is an upper bound for active security with optimal resilience t < n/2 and security parameter κ. This improves on the communica...
متن کاملRound Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience
In information theoretic model, unconditionally secure multiparty computation (UMPC) allows a set of n parties to securely compute an agreed function f , even upto t < n/2 parties are under the control of an active adversary having unbounded computing power. The bound on the resilience/fault tolerance (i.e t < n/2 ) is optimal, as long as each party is connected with every other party by a secu...
متن کاملIncoercible Multiparty Computation
Current secure multiparty protocols have the following deficiency. The public transcript of the communication can be used as an involuntary commitment of the parties to their inputs and outputs. Thus parties can be later coerced by some authority to reveal their private data. Previous work that has pointed this interesting problem out contained only partial treatment. In this work we present th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008